一类二层凸规划的分解法

研究了一类二层凸规划和与之相应的凸规划问题的等价性．并讨论了这类凸规划的对偶性和鞍点问题,最后给出了求解这类二层凸规划的一个分解法．     

m值逻辑函数的谱分解式及广义Bent函数的递归构造

本文用概率方法得到ｍ值逻辑函数Ｃｈｒｅｓｔｅｎｓｏｎ循环谱的分解式,据此考察了ｍ值广义Ｂｅｎｔ函数一些新的性质,给出了递归构造ｍ（ｍ≠２ｍｏｄ４）值广义Ｂｅｎｔ函数的一般方法．     

Electronic structure of C60 films

A complete set of fundamental optical functions of fullerite (C₆₀) films in energy ranges of 2.5–5.0 and 4.0–9.0 eV is calculated using the known spectra of the imaginary and real parts of the dielectric constant. An integrated spectrum of the dielectric constant is decomposed into elementary components. Three basic parameters of each component (the maximum and halfwidth energies and oscillator strength) are determined. Based on the known theoretical calculations of fullerite zones, a scheme of the nature of these components of the dielectric constant is suggested. Udmurt State University, 71, Krasnogeroiskaya Str., Izhevsk, 426034, Russia. Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 66, No. 2, pp. 227–232, March–April, 1999.     

Asymmetric decompositions of abelian groups

A subsetA of an Abelian groupG is said to be asymmetric ifg+S⊄A for any elementg∈G and any infinite symmetric subsetS⊂G (S=−S). The minimal cardinality of a decomposition of the groupG into asymmetric sets is denoted by ν(G). for any Abelian groupG, the cardinal number ν(G is expressed via the following cardinal invariants: the free rank, the 2-rank, and the cardinality of the group. In particular, . Translated fromMatematicheskie Zametki, Vol. 66, No. 1, pp. 10–19, July, 1999.     

The conjugacy problem for Dehn twist automorphisms of free groups

A Dehn twist automorphism of a group G is an automorphism which can be given (as specified below) in terms of a graph-of-groups decomposition of G with infinite cyclic edge groups. The classic example is that of an automorphism of the fundamental group of a surface which is induced by a Dehn twist homeomorphism of the surface. For , a non-abelian free group of finite rank n, a normal form for Dehn twist is developed, and it is shown that this can be used to solve the conjugacy problem for Dehn twist automorphisms of . Received: February 12, 1996.     

Low Rank Approximation of a Hankel Matrix by Structured Total Least Norm

The structure preserving rank reduction problem arises in many important applications. The singular value decomposition (SVD), while giving the closest low rank approximation to a given matrix in matrix L ₂ norm and Frobenius norm, may not be appropriate for these applications since it does not preserve the given structure. We present a new method for structure preserving low rank approximation of a matrix, which is based on Structured Total Least Norm (STLN). The STLN is an efficient method for obtaining an approximate solution to an overdetermined linear system AX B, preserving the given linear structure in the perturbation [E F] such that (A + E)X = B + F. The approximate solution can be obtained to minimize the perturbation [E F] in the L _p norm, where p = 1, 2, or . An algorithm is described for Hankel structure preserving low rank approximation using STLN with L _p norm. Computational results are presented, which show performances of the STLN based method for L ₁ and L ₂ norms for reduced rank approximation for Hankel matrices.     

On Potential Theoretic Skeletons of Polyhedra

We prove that any polyhedron in two dimensions admits a type of potential theoretic skeleton called mother body. We also show that the mother bodies of any polyhedron in any number of dimensions are in one-to-one correspondence with certain kinds of decompositions of the polyhedron into convex subpolyhedra. A consequence of this is that there can exist at most finitely many mother bodies of any given polyhedron. The main ingredient in the proof of the first mentioned result consists of showing that any polyhedron in two dimensions contains a convex subpolyhedron which sticks to it in the sense that every face of the subpolyhedron has some part in common with a face of the original polyhedron.     

Ringel对偶代数的三角分解

本文证明了树型偏序集的扭双指标代数的Ringel对偶代数存在三角分解,并具体给出了一种三角分解的结构,     

A production-transportation problem with stochastic demand and concave production costs

Well known extensions of the classical transportation problem are obtained by including fixed costs for the production of goods at the supply points (facility location) and/or by introducing stochastic demand, modeled by convex nonlinear costs, at the demand points (the stochastic transportation problem, [STP]). However, the simultaneous use of concave and convex costs is not very well treated in the literature. Economies of scale often yield concave cost functions other than fixed charges, so in this paper we consider a problem with general concave costs at the supply points, as well as convex costs at the demand points. The objective function can then be represented as the difference of two convex functions, and is therefore called a d.c. function. We propose a solution method which reduces the problem to a d.c. optimization problem in a much smaller space, then solves the latter by a branch and bound procedure in which bounding is based on solving subproblems of the form of [STP]. We prove convergence of the method and report computational tests that indicate that quite large problems can be solved efficiently. Problems up to the size of 100 supply points and 500 demand points are solved. Received October 11, 1993 / Revised version received July 31, 1995 Published online November 24, 1998